Halfspace range search: An algorithmic application ofk-sets
نویسندگان
چکیده
منابع مشابه
Approximate Halfspace Range Counting
We present a simple scheme extending the shallow partitioning data structures of Matoušek, that supports efficient approximate halfspace range-counting queries in R with relative error ε. Specifically, the problem is, given a set P of n points in R, to preprocess them into a data structure that returns, for a query halfspace h, a number t so that (1−ε)|h∩P | ≤ t ≤ (1+ε)|h∩P |. One of our data s...
متن کاملOptimal halfspace range reporting in three dimensions
We give the first optimal solution to a standard problem in computational geometry: three-dimensional halfspace range reporting. We show that n points in 3-d can be stored in a linear-space data structure so that all k points inside a query halfspace can be reported in O(log n + k) time. The data structure can be built in O(n logn) expected time. The previous methods with optimal query time req...
متن کاملAlgorithmic Entropy of Sets
In a previous paper a theory of program size formally identical to information theory was developed. The entropy of an individual finite object was defined to be the size in bits of the smallest program for calculating it. It was shown that this is − log2 of the probability that the object is obtained by means of a program whose successive bits are chosen by flipping an unbiased coin. Here a th...
متن کاملThe Statistical Mechanics ofk
The satissability of random CNF formulae with precisely k variables per clause (\k-SAT") is a popular testbed for the performance of search algorithms. Formulae have M clauses from N variables, randomly negated, keeping the ratio = M=N xed. For k = 2, this model has been proven to have a sharp threshold at = 1 between formulae which are almost aways satissable and formulae which are almost neve...
متن کاملAlgorithmic Randomness of Closed Sets
We investigate notions of randomness in the space C[2N] of nonempty closed subsets of {0, 1}N. A probability measure is given and a version of the Martin-Löf test for randomness is defined. Π2 random closed sets exist but there are no random Π1 closed sets. It is shown that any random closed set is perfect, has measure 0, and has box dimension log2 4 3 . A random closed set has no n-c.e. elemen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete & Computational Geometry
سال: 1986
ISSN: 0179-5376,1432-0444
DOI: 10.1007/bf02187685